Complete graph

Results: 868



#Item
181Mathematics / Heuristics / Cognition / Game artificial intelligence / Routing algorithms / Search algorithms / NP-complete problems / A* search algorithm / Applied mathematics / Admissible heuristic / Algorithm / 15 puzzle

Artificial Intelligence–123 Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search ✩ XuanLong Nguyen 1 , Subbarao Kambhampati ∗ , Romeo S. Nigenda Depart

Add to Reading List

Source URL: rakaposhi.eas.asu.edu

Language: English - Date: 2009-07-17 17:36:19
182Graph theory / NP-complete problems / Independent set / Matching / Clique / Ear decomposition / Graph coloring / Trapezoid graph

arXiv:1106.2436v3 [cs.LG] 25 OctFrom Bandits to Experts: On the Value of Side-Observations Ohad Shamir Microsoft Research New England

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2011-10-26 04:59:45
183

Consider n randomly placed points on a circle.   n 1. The complete graph on the n points has edges. 2

Add to Reading List

Source URL: www.texample.net

- Date: 2011-12-05 16:02:33
    184Graph theory / Mathematics / Graph connectivity / Algorithm / Mathematical logic / Theoretical computer science / Path / Local search / Ear decomposition / Eulerian path

    MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com A Complete and Effective Move Set for Simplified Protein Folding

    Add to Reading List

    Source URL: www.eecs.harvard.edu

    Language: English - Date: 2003-02-21 13:49:05
    185Graph theory / Mathematics / NP-complete problems / NP-hard problems / Operations research / Travelling salesman problem / Matching / Eulerian path / Hamiltonian path / Minimum spanning tree / Cycle / Line graph

    Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007

    Add to Reading List

    Source URL: vigna.di.unimi.it

    Language: English - Date: 2014-10-22 08:43:20
    186Mathematics / Graph coloring / NP-complete problems / Hypergraph / Discrete mathematics / Theoretical computer science

    Lev Reyzin Clique Talk, 2007  

    Add to Reading List

    Source URL: www.levreyzin.com

    Language: English - Date: 2009-10-27 11:25:10
    187Combinatorial optimization / Graph theory / NP-complete problems / Network theory / Edsger W. Dijkstra / Steiner tree problem / Simplex / Matching / Bipartite graph / Graph / Shortest path problem / A* search algorithm

    On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich

    Add to Reading List

    Source URL: www.cs.rpi.edu

    Language: English - Date: 2011-07-18 11:44:43
    188Graph theory / Mathematics / Computational complexity theory / Network theory / Spanning tree / NP-complete problems / Edsger W. Dijkstra / Shortest path problem / Longest path problem / Minimum spanning tree / Reverse-delete algorithm

    December 15, Fall 2008 Final Examination Introduction to Algorithms Massachusetts Institute of Technology

    Add to Reading List

    Source URL: courses.csail.mit.edu

    Language: English - Date: 2009-05-07 21:09:13
    189Graph theory / Bipartite graph / Parity / Graph / Ear decomposition / Matching / NP-complete problems / Graph coloring / Line graph

    Recovering Social Networks by Observing Votes Benjamin Fish and Yi Huang and Lev Reyzin Department of Mathematics, Statistics, & Computer Science University of Illinois at Chicago, Chicago, IL 60607 {bfish3,yihuang89,lre

    Add to Reading List

    Source URL: www.levreyzin.com

    Language: English - Date: 2015-12-18 15:57:04
    190Graph theory / Graph / Thrackle / Path / NP-complete problems / Hamiltonian path / Skew-symmetric graph

    Five $1,000 Problems - John H. Conway! ! ! !

    Add to Reading List

    Source URL: cheswick.com

    Language: English - Date: 2014-10-13 09:47:48
    UPDATE